Hierarchical Meta-Logics for Belief and Provability: How We Can Do Without Modal Logics
نویسنده
چکیده
14 Vladimir Lifschitz have provided useful feedback. Alex Simpson has proof checked some versions of this paper and corrected some of the mistakes.
منابع مشابه
Tractable Transformations from Modal Provability Logics into First-Order Logic
We deene a class of modal logics LF by uniformly extending a class of modal logics L. Each logic L is characterised by a class of rst-order deenable frames, but the corresponding logic LF is sometimes characterised by classes of modal frames that are not rst-order deenable. The class LF includes provability logics with deep arithmeti-cal interpretations. Using Belnap's proof-theoretical framewo...
متن کاملProvability and Interpretability Logics with Restricted Realizations
The provability logic of a theory T is the set of modal formulas, which under any arithmetical realization are provable in T . We slightly modify this notion by requiring the arithmetical realizations to come from a specified set Γ. We make an analogous modification for interpretability logics. We first studied provability logics with restricted realizations, and show that for various natural c...
متن کاملJustification Logics and Conservative Extensions
Several justification logics have evolved, starting with the logic LP, [2]. These can be thought of as explicit versions of modal logics, or logics of knowledge or belief in which the unanalyzed necessity operator has been replaced with a family of explicit justification terms. Modal logics come in various strengths. For their corresponding justification logics, differing strength is reflected ...
متن کاملTheoremhood Preserving Maps Characterising Cut Elimination for Modal Provability Logics
Propositional modal provability logics like G and Grz have arithmetical interpretations where 2φ can be read as “formula φ is provable in Peano Arithmetic”. These logics are decidable but are characterised by classes of Kripke frames which are not first-order definable. By abstracting the aspects common to their characteristic axioms we define the notion of a formula generation map F(p) in one ...
متن کاملAll finitely axiomatizable subframe logics containing the provability logic CSM 0_{0} are decidable
In this paper we investigate those extensions of the bimodal provability logic CSM 0 (alias PRL 1 or F ?) which are subframe logics, i.e. whose general frames are closed under a certain type of substructures. Most bimodal provability logics are in this class. The main result states that all nitely axiomatizable subframe logics containing CSM 0 are decidable. We note that, as a rule, interesting...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991